Polynomial approximations in a generalized Nyman–Beurling criterion
نویسندگان
چکیده
The Nyman–Beurling criterion, equivalent to the Riemann hypothesis (RH), is an approximation problem in space of square integrable functions on (0,?), involving dilations fractional part function by factors ? k ?(0,1), k?1. Randomizing generates new structures and criteria. One them a sufficient condition for RH that splits into
منابع مشابه
A generalized backdoor criterion
We generalize Pearl’s back-door criterion for directed acyclic graphs (DAGs) to more general types of graphs that describe Markov equivalence classes of DAGs and/or allow for arbitrarily many hidden variables. We also give easily checkable necessary and sufficient graphical criteria for the existence of a set of variables that satisfies our generalized back-door criterion, when considering a si...
متن کاملIterated Bernstein polynomial approximations
Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i = 0, 1, . . . , n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is significantly improved by the iterated Bernstein polynomial approximations without increasing the degree of the polynomials. The same idea applies to the...
متن کاملA Complete Generalized Adjustment Criterion
Covariate adjustment is a widely used approach to estimate total causal effects from observational data. Several graphical criteria have been developed in recent years to identify valid covariates for adjustment from graphical causal models. These criteria can handle multiple causes, latent confounding, or partial knowledge of the causal structure; however, their diversity is confusing and some...
متن کاملA Polynomial Time Presburger Criterion and Synthesis
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significant digit first). Since 1969 [9, 29], we know that any Presburger-definable set [26] (a set of integer vectors satisfying a formula in the first-order additive theory of the integers) can be represented by a NDD, and eff...
متن کاملOn Polynomial Approximations to AC
We make progress on some questions related to polynomial approximations of AC0. It is known, by works of Tarui (Theoret. Comput. Sci. 1993) and Beigel, Reingold, and Spielman (Proc. 6th CCC 1991), that any AC0 circuit of size s and depth d has an ε-error probabilistic polynomial over the reals of degree (log(s/ε))O(d). We improve this upper bound to (log s)O(d) · log(1/ε), which is much better ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Theorie des Nombres de Bordeaux
سال: 2023
ISSN: ['1246-7405', '2118-8572']
DOI: https://doi.org/10.5802/jtnb.1227